Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
نویسندگان
چکیده
منابع مشابه
The Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is solved by finding the tree with minimal Euclidean length spanning a set of fixed vertices in the plane, while allowing for the addition of auxiliary vertices (Steiner vertices). Steiner trees are widely used to design real-world structures like highways and oil pipelines. Unfortunately, the Euclidean Steiner Tree Problem has shown to be NP-Hard, meaning the...
متن کاملAn Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...
متن کاملAn Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...
متن کاملFast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem
Bottleneck Steiner tree problem asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. The problem has applications in the design of wireless communication networks. In this paper we study a restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Stein...
متن کاملA Parallel Monte-Carlo Tree Search Algorithm
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a network of computers using various configurations: from 12,500 to 100,000 playouts, from 1 to 64 slaves, and from 1 to 16 computers. On our architecture we obtain a speedup of 14 for 16 slaves. With a single slave and fiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Telecommunications and Information Technology
سال: 2017
ISSN: 1509-4553,1899-8852
DOI: 10.26636/jtit.2017.122017